An Adaptive Differential Evolution Algo- Rithm for Autonomous Deployment and Lo- Calization of Sensor Nodes

نویسندگان

  • S. Roy
  • S. Minhazul Islam
  • S. Ghosh
  • S. Das
  • A. Abraham
چکیده

In recent years, Wireless Sensor Networks (WSNs) have transitioned from being objects of academic research interest to a technology that is frequently being employed in real-life applications and rapidly being commercialized. The performance of a WSN is largely affected by high quality deployment and precise localization of sensor nodes. This article deliberates autonomous deployment of sensor nodes from an Unmanned Aerial Vehicle (UAV). This kind of deployment has importance in emergency applications, such as disaster monitoring and battlefield surveillance. The goal is to deploy the nodes only in the terrains of interest, which are distinguished by segmentation of the images captured by a camera on board the UAV. In this article we propose an improved variant of a very powerful real parameter optimizer, called Differential Evolution (DE) for image segmentation and for distributed localization of the deployed nodes. Image segmentation for autonomous deployment and distributed localization are designed as multidimensional optimization problems and are solved by the proposed algorithm. Performance of the proposed algorithm is compared with other prominent adaptive DE-variants like SaDE and JADE as well as a powerful variant of the Particle Swarm optimization (PSO) algorithm, called CLPSO. Simulation results indicate that the proposed algorithm performs image segmentation faster than both types of algorithm for optimal thresholds. Moreover in case of localization it gives more accurate Received 23 February 2011, Accepted 11 April 2011, Scheduled 13 April 2011 Corresponding author: Swagatam Das ([email protected]).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks

Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...

متن کامل

Improved Differential Evolution in WSN Node Deployment

WSN consists of a large number of tiny sensor nodes distributed over a large area with one or more powerful sinks or base stations collecting information from these sensor nodes. The sensor nodes are equipped with battery and whose battery cannot be replaced after deployment. Therefore, deployment of sensor nodes has serious impact on network lifetime. Deployment can be random or pre-determined...

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

A novel key management scheme for heterogeneous sensor networks based on the position of nodes

Wireless sensor networks (WSNs) have many applications in the areas of commercial, military and environmental requirements. Regarding the deployment of low cost sensor nodes with restricted energy resources, these networks face a lot of security challenges. A basic approach for preparing a secure wireless communication in WSNs, is to propose an efficient cryptographic key management protocol be...

متن کامل

LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring

Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011